Further note on Maclaurin’s spheroid

A Further Note on Runs in Independent Sequences

Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...

A Further Note on Alternatives to Bpref

This paper compares the robustness of information retrieval (IR) metrics to incomplete relevance assessments, using four different sets of graded-relevance test collections with submitted runs – two from TREC and two from NTCIR. We investigate the effect of reducing the original relevance data on discriminative power (i.e., how often statistical significance can be detected given the probabilit...

A further note on mongolism in twins.

A Further Note on Inductive Generalization

In this paper, we develop the algorithm, given in Plotkin (1970), for finding the least generalization of two clauses, into a theory of inductive generalization. The types of hypothesis which can be formed are very simple. They all have the form: (x)Pxm Qx. We have been guided by ideas from the philosophy of science, following Buchanan (1966). There is no search for infallible methods of genera...

An extension of Maclaurins inequality

Let G be a graph of order n and clique number !: For every x = (x1; : : : ; xn) 2 Rn and 1 s !; set fs (G;x) = X fxi1 : : : xis : fi1; : : : ; isg is an s-clique of Gg ; and let s (G;x) = fs (G;x) ! s 1 : We show that if x 0; then 1 (G;x) 1=2 2 (G;x) 1=! ! (G;x) : This extends the inequality of Maclaurin (G = Kn) and generalizes the inequality of Motzkin and Straus. In addition, if x > 0; for e...